theoretical heuristics

См. также в других словарях:

• Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… …   Wikipedia

• Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

• List of cognitive biases — A cognitive bias is a pattern of poor judgment, often triggered by a particular situation. Identifying poor judgment, or more precisely, a deviation in judgment, requires a standard for comparison, i.e. good judgment . In scientific… …   Wikipedia

• thought — thought1 /thawt/, n. 1. the product of mental activity; that which one thinks: a body of thought. 2. a single act or product of thinking; idea or notion: to collect one s thoughts. 3. the act or process of thinking; mental activity: Thought as… …   Universalium

• Behavioral economics — and its related area of study, behavioral finance, use social, cognitive and emotional factors in understanding the economic decisions of individuals and institutions performing economic functions, including consumers, borrowers and investors,… …   Wikipedia

• 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

• Q-Q plot — Not to be confused with P P plot. A normal Q Q plot of randomly generated, independent standard exponential data, (X   Exp(1)). This Q Q plot compares a sample of data on the vertical axis to a statistical population on the horizontal… …   Wikipedia

• Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

• Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… …   Wikipedia

• Maximum parsimony — Maximum parsimony, often simply referred to as parsimony, is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under maximum parsimony, the preferred phylogenetic tree is the tree that… …   Wikipedia

• Maximum parsimony (phylogenetics) — Parsimony is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under parsimony, the preferred phylogenetic tree is the tree that requires the least evolutionary change to explain some… …   Wikipedia